Performance Evaluation Using Timed Coloured Petri Nets

Coloured Petri nets are Petri nets in which attributes are associated with individual tokens. These attributes are called “colours”. The set of colours is finite. Colors can be modified during transition firings, and the same transition can perform diffcrcn t transformations for tokens of different colours. Colours can thus distinguish tokens, and this allows to “fold” similar subnets of a net into a single subnet, reducing the model complexity. In timcd coloured nets, the transitions fire in “real-time”, i.e., there is a firing-time associated with each colour and each transition of a net. A state description of timed nets is proposed which represents the behaviour of a timed coloured net by a probabilistic state graph. Performance analysis of timed coloured nets is based on stationary probabilities of states.